Symmetric Two-Workshop Heuristic Integrated Scheduling Algorithm Based on Process Tree Cyclic Decomposition

نویسندگان

چکیده

The existing research on the two-workshop integrated scheduling problem with symmetrical resources does not consider complex product attribute structure and objective situation of plant equipment resources. This results in prolongation makespan reduction utilization rate general workshop. To solve above problems, a algorithm based process tree cyclic decomposition (STHIS-PTCD) was proposed. First, workshop scheme sub-tree strategy proposed to improve closeness continuous processing further. Second, an operation allocation principle balance presented. On basis ensuring advantages parallel processing, it also effectively reduces idle time then optimizes overall effect both workshops. Through comparison analysis all resource-symmetric algorithms, is best.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Heuristic Algorithm for Tree Decomposition

Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem and different algorithms have been proposed in the literature for generation of tree decompositions of small width. In this paper is presented new iterated local search algorithm to find good upper bounds for treewidth...

متن کامل

A two-stage approach based on Ant Colony Optimization Algorithm for Integrated Process Planning and Scheduling

This paper presents a two-stage heuristic using Ant Colony Optimization (ACO) to solve Integrated Process Planning and scheduling (IPPS) problem. The algorithm is incorporated with the objective of obtaining an optimal or near optimal schedule for a number of jobs with multi-operations. A graphical search method is used, where artificial ants are assigned as software agents to search for routin...

متن کامل

A Heuristic Greedy Algorithm for Scheduling Out-Tree Task Graphs

The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules wi...

متن کامل

An Optimization of Process Scheduling Based on Heuristic GA

For the execution of the real time applications and to compute the high performance of each job, multiprocessor is the powerful tool. Such type of system highly depends on the parallel and distributed computing environment and generates a parallel and distributed network system. Consequently, several methods have been developed to optimally tackle the multiprocessor task scheduling problem whic...

متن کامل

A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12071553